Search results for "Routing protocol"
showing 10 items of 81 documents
Addressing Manufacturing Challenges with Cost-Efficient Fault Tolerant Routing
2010
The high-performance computing domain is enriching with the inclusion of Networks-on-chip (NoCs) as a key component of many-core (CMPs or MPSoCs) architectures. NoCs face the communication scalability challenge while meeting tight power, area and latency constraints. Designers must address new challenges that were not present before. Defective components, the enhancement of application-level parallelism or power-aware techniques may break topology regularity, thus, efficient routing becomes a challenge.In this paper, uLBDR (Universal Logic-Based Distributed Routing) is proposed as an efficient logic-based mechanism that adapts to any irregular topology derived from 2D meshes, being an alter…
An efficient distributed algorithm for generating and updating multicast trees
2006
As group applications are becoming widespread, efficient network utilization becomes a growing concern. Multicast transmission represents a necessary lower network service for the wide diffusion of new multimedia network applications. Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in networks) is prohibitively expensive. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem, allowing the construction of effective distribution trees using a coordination protocol among the network nodes. Furthermore, we propose a novel distribut…
A new Media Access Control layer Quality of Service multicast scheme for IEEE 802.11s based wireless mesh networks
2014
Inderscience Publishers; International audience; We propose a new Media Access Control (MAC) layer enabling Quality of Service (QoS) multicast scheme for IEEE 802.11s networks, where a unicast routing protocol called HWMP (Hybrid Wireless Mesh Protocol) is defined. The HWMP protocol is more adapted for best effort traffic, that's why its usage is not suitable for real time multimedia applications. The goal of our proposed mechanism is to take into account multicast communication under QoS constraints for the IEEE 802.11s mesh networks where no QoS multicasting has been defined. Our multicasting scheme handles QoS guarantee for real time applications. Indeed, our scheme is based on finding t…
Implementation and Deployment Evaluation of the DMAMAC Protocol for Wireless Sensor Actuator Networks
2016
Abstract The increased application of wireless technologies including Wireless Sensor Actuator Networks (WSAN) in industry has given rise to a plethora of protocol designs. These designs target metrics ranging from energy efficiency to real-time constraints. Protocol design typically starts with a requirements specification, and continues with analytic and model-based simulation analysis. State-of- the-art network simulators provide extensive physical environment emulation, but still have limitations due to model abstractions. Deployment testing on actual hardware is therefore vital in order to validate implementability and usability in the real environment. The contribution of this article…
Geographical Routing for Delay Tolerant Encounter Networks
2007
Delay Tolerant Networks (DTNs) are intermittently connected networks, where direct end--to--end path between communicating nodes may never exist. To achieve eventual delivery some nodes must store messages and wait opportunity to forward them. In mobile environment, one of the most challenging problems for routing protocols is to decide, which nodes should store the message to achieve eventual delivery as quick as possible. Common approach is to propagate message into large group of nodes, hoping one of them will reach the destination. These solutions, however, are not very scalable as they generate plenty of extra load and traffic to network. Further more, message carriers have no means to…
A Probabilistic Approach to the Count-To-Infinity Problem in Distance-Vector Routing Algorithms
2013
Count-to-infinity problem is characteristic for routing algorithms based on the distributed implementation of the classical Bellman-Ford algorithm. In this paper a probabilistic solution to this problem is proposed. It is argued that by the use of a Bloom Filter added to the routing message the routing loops will with high probability not form. An experimental analysis of this solution for use in Wireless Sensor Networks in practice is also included.
A Novel Energy Model for MANETs based on Graphs with Activation Windows
2005
Energy usage optimization is still an important issue and a critical design factor for mobile ad hoc networks (MANETs). Only recently a few proposals appeared that consider energy-aware optimizations for routing protocols. In this paper we describe an analytical model for MANETs which is based on graphs with activation windows. The activation windows allow to model the on-off status of the network devices. Moreover, we propose an algorithm with pseudo-polynomial complexity, called STP algorithm (STPA), that based on the current position and state of the nodes determines the shortest time path between the source node and the destination node.
Lifespan-Aware Routing for Wireless Sensor Networks
2010
Wireless Sensor Networks (WSNs) have the capability to become the eyes and ears for the future networked society allowing monitoring of any habitat or object's properties remotely and independently of an energy source. Services based on this technology may change the way we monitor and control remote areas and objects. In this paper we propose a different approach to routing data across Wireless Sensor Networks. We argue that a distance-vector protocol using a lifespan-aware metric is a plausible solution to the task of routing information in WSN in a manner that both saves energy of the individual node and manages summarized energy of the system equally and fairly. The concept is designed …
Stability Analysis of Routing Strategies for the Maximum Lifetime Problem in One-Dimensional Ad-Hoc Wireless Networks
2017
In the paper we discuss solutions of the maximum network lifetime problem in one-dimensional, regular ad-hoc wireless networks. For the problem, nodes of the network generate given amount of data and send it possibly via other nodes to the data collector. To extend the network lifetime the data should be transmitted in such a way, that the energy utilized by the most overloaded node is minimized. We assume, that the nodes use the point-to-point data transmission scheme and the cost of transmission of one unit of data is arbitrary superadditive function of a distance between transmitter and receiver. We show that for the one-dimensional network in which the nodes are evenly distributed on th…
A Branch-and-Cut method for the Capacitated Location-Routing Problem
2011
International audience; Recent researches in the design of logistic networks have shown that the overall distribution cost may be excessive if routing decisions are ignored when locating depots. The Location-Routing Problem (LRP) overcomes this drawback by simultaneously tackling location and routing decisions. The aim of this paper is to propose an exact approach based on a Branch-and-Cut algorithm for solving the LRP with capacity constraints on depots and vehicles. The proposed method is based on a zero-one linear model strengthened by new families of valid inequalities. The computational evaluation on three sets of instances (34 instances in total), with 5–10 potential depots and 20–88 …